A note on outer bounds for broadcast channel
نویسنده
چکیده
In this note we establish two facts concerning the so-called New-Jersey outer bound. We show that this outer bound is equivalent to a much simpler computable region; and secondly we show that in the absence of private information this bound is exactly same as the UV -outerbound.
منابع مشابه
Distortion Bounds for Source Broadcast Problem
This paper investigates the joint source-channel coding problem of sending a memoryless source over a memoryless broadcast channel. An inner bound and several outer bounds on the achievable distortion region are derived, which respectively generalize and unify several existing bounds. As a consequence, we also obtain an inner bound and an outer bound for degraded broadcast channel case. When sp...
متن کاملTwo Classes of Broadcast Channels With Side-Information: Capacity Outer Bounds
In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel where a sender transmits two independent messages to two receivers. A constraint that each message must be kept confidential from the unintended receiver cons...
متن کاملAn outer bound for 2-receiver discrete memoryless broadcast channels
An outer bound to the discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملOn the Capacity of Wireless 1-Hop Intersession Network Coding — A Broadcast Packet Erasure Channel Approach
Motivated by practical wireless network protocols, this paper answers the following questions: Exactly (or at most) how much throughput improvement one can expect from intersession network coding (INC) in a 1-hop neighborhood over non-coding solutions; and how to achieve (or approach) the capacity. Focusing on a two-stage setting, this work first provides a capacity outer bound for any number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1101.0640 شماره
صفحات -
تاریخ انتشار 2010